Chaotic Bee Swarm Optimization Algorithm for Path Planning of Mobile Robots

نویسندگان

  • Jiann-Horng Lin
  • Li-Ren Huang
چکیده

This paper is based on swarm intelligence and chaotic dynamics for learning. We address this issue by considering the problem of path planning for mobile robots. Autonomous systems assume intelligent behavior with ability of dealing in complex and changing environments. Path planning problem, which can be studied as an optimization problem, seems to be of high importance for arising of intelligent behavior for different real-world problem domains. In recent years, swarm intelligence has gained increasingly high interest among the researchers from different domains such as commerce, science and engineering. Bees’ warming about their hive is an example of swarm intelligence. It’s particularly fitting apply methods inspired by swarm intelligence to sundry optimization problems, and chiefly if the space to be explored is large and complex. In this paper, we propose a new approach to the problem of path planning for mobile robots based on an improved artificial bee colony optimization combined with chaos. In artificial bee colony optimization, chaos is hybridized to form a chaotic bee swarm optimization, which reasonably combines the population-based evolutionary searching ability of artificial bee colony optimization and chaotic searching behavior. The track of chaotic variable can travel ergodically over the whole search space. In general, the chaotic variable has special characters, i.e., ergodicity, pseudo-randomness and irregularity. Generally, the parameters of the artificial bee colony optimization are the key factors to affect the convergence of the artificial bee colony optimization. In fact, however, it cannot ensure the optimization’s ergodicity entirely in phase space because they are absolutely random in the traditional artificial bee colony optimization. Therefore, this paper provides a new method that introduces chaotic mapping with certainty, ergodicity and the stochastic property into artificial bee colony optimization so as to improve the global convergence. Key-Words: path planning problem, artificial bee colony, chaotic dynamics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Path Planning in Swarm Robots using Particle Swarm Optimisation on Potential Fields

This article presents a novelimplementation of Particle Swarm Optimisation(PSO)forfinding the most optimal solution to path planning problem for a swarm of robots. The swarm canvasses through the configuration space having static obstaclesby applying PSO on potential fields generated by the target. The best possible path by the momentary leaders of the group is retraced toget the solution. The ...

متن کامل

On-line Path Planning for Mobile Robots in Dynamic Environments

Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...

متن کامل

Real-time obstacle avoidance for a swarm of autonomous mobile robots

In this paper, we propose a computational trajectory generation algorithm for swarm mobile robots using local information in a dynamic environment. The algorithm plans a reference path based on constrained convex nonlinear optimization which avoids both static and dynamic obstacles. This algorithm is combined with one-step-ahead predictive control for a swarm of mobile robots to track the gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009